结合àtrous算法与Retinex算法的医学图像增强

提出结合àtrous算法与Retinex算法的医学图像增强.方法在二进小波理论基础上,利用推广的二维àtrous算法对医学图像进行处理,对经过多级分解后的医学图像的低频利用连续非线性函数增强,而对分解后的多个高频采用改进的Retinex算法进行增强;最后,对增强后的低频和高频进行重构.经过反复仿真试验结果表明:方法在去除噪声的同时更好地保留了图像边缘特征,增强了图像细节信息和凸显图像的轮廓,并克服对比度下降的不足,较好地去除光晕现象,视觉效果好,层次感更丰富.     

循环取货模式下的多车场协同运输问题研究

分析循环取货模式和协同运输问题的关联性,提出了供需节点分离下的多车场一体化协同运输路线优化问题,考虑运输价值和运输成本,引入节点-弧流量的概念,通过比较流量大小确定节点集合,构建了问题的多供应点、多需求点运输模型.考虑取货的单向性和送货的闭合性,构造了求解模型的两阶段算法,运用动态规划的递推解法确定取货最优路线,然后基于余弦定理的几何法求解出发点和返回点不相同的送货路径优化问题,最后通过算例分析,说明了模型的合理性和算法的有效性.     

I������ɾʧ�����¼���ʧЧ������ģ�͵Ĺ�������

A cured model is a useful approach for analysing failure time data in which some subjects could eventually experience and others never experience the event of interest. All subjects in the test belong to one of the two groups: the susceptible group and the non-susceptible group. There has been considerable progress in the development of semi-parametric models for regression analysis of time-to-event data. However, most of the current work focuses on right-censored data, especially when the population contains a non-ignorable cured subgroup. In this paper, we propose a semi-parametric cure model for current status data. In general, treatments are developed to both increase the patients' chances of being cured and prolong the survival time among non-cured patients. A logistic regression model is proposed for whether the subject is in the susceptible group. An accelerated failure time regression model is proposed for the event time when the subject is in the non-susceptible group. An EM algorithm is used to maximize the log-likelihood of the observed data. Simulation results show that the proposed method can get efficient estimations.     

高维约束矩阵回归问题

高维约束矩阵回归是指高维情况下带非凸约束的多响应多预测统计回归问题,其数学模型是一个NP-难的矩阵优化,它在机器学习与人工智能、医学影像疾病诊疗、基因表达分析、脑神经网络、风险管理等领域有广泛应用.从高维约束矩阵回归的优化理论和算法两方面总结和评述这些新成果,同时,列出了相应的重要文献.     

半监督度量学习内蕴最速下降算法的收敛性分析

主要研究对称正定矩阵群上的内蕴最速下降算法的收敛性问题.首先针对一个可转化为对称正定矩阵群上无约束优化问题的半监督度量学习模型,提出对称正定矩阵群上一种自适应变步长的内蕴最速下降算法.然后利用李群上的光滑函数在任意一点处带积分余项的泰勒展开式,证明所提算法在对称正定矩阵群上是线性收敛的.最后通过在分类问题中的数值实验说明算法的有效性.     

稀土安全评价:集成算法改进与实证

稀土作为我国战略性矿产资源,其安全问题一直是政府和学术界关注与研究的重要课题.建立了稀土安全的概念框架与评价体系,针对传统AHP中九标度法的不足,基于熵值法、加速遗传算法及扩充标度值的层次分析法,提出了一种改进的层次分析法(EV-AGA-EAHP),通过集成模糊C-均值聚类算法和模糊综合评价法,研究提出了一种模糊综合集成评价方法(EV-AGA-EAHP-FCM-FIJ),给出了集成算法及步骤,对2001-2013年我国稀土安全水平进行了评价,提出了保障我国稀土安全的建议.     

Volterra核函数法在轴承滚珠磨损中的特征提取及应用

针对滚动轴承滚珠磨损故障特征难以提取的问题,提出一种基于多脉冲激励法下的Volterra级数核的求解算法.该方法是一种非线性系统模型的“交叉”诊断法,利用轴承系统输入输出的采样信号,建立Volterra非线性辨识系统模型,并运用多脉冲激励Volterra低阶核求解算法,将得到的低阶核通过时域和频域进行对比来判断轴承当前所处的运行状态.该文以无心车床主轴轴承为例进行实验验证,并与传统的小波分析法对比得出:多脉冲激励法能够方便准确地提取轴承的故障特征,该方法对此类故障的诊断具有一定的借鉴意义.     

Efficient Computation of the Joint Sample Frequency Spectra for Multiple Populations

A wide range of studies in population genetics have employed the sample frequency spectrum (SFS), a summary statistic which describes the distribution of mutant alleles at a polymorphic site in a sample of DNA sequences and provides a highly efficient dimensional reduction of large-scale population genomic variation data. Recently, there has been much interest in analyzing the joint SFS data from multiple populations to infer parameters of complex demographic histories, including variable population sizes, population split times, migration rates, admixture proportions, and so on. SFS-based inference methods require accurate computation of the expected SFS under a given demographic model. Although much methodological progress has been made, existing methods suffer from numerical instability and high computational complexity when multiple populations are involved and the sample size is large. In this article, we present new analytic formulas and algorithms that enable accurate, efficient computation of the expected joint SFS for thousands of individuals sampled from hundreds of populations related by a complex demographic model with arbitrary population size histories (including piecewise-exponential growth). Our results are implemented in a new software package called momi (MOran Models for Inference). Through an empirical study, we demonstrate our improvements to numerical stability and computational complexity.     

New upper bounds for online strip packing

In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into one or more strips of width 1 and infinite height so as to minimize the required height of the packing. By analyzing a two-phase shelf algorithm, we derive a new upper bound 6.4786 on the competitive ratio for online one strip packing. This result improves the best known upper bound of 6.6623. We also extend this algorithm to online multiple strips packing and present some numeric upper bounds on their competitive ratios which are better than the previous bounds.